Receiver scheduling in ad hoc wireless networks

ABSTRACT

A wireless network ( 100 ) includes a communications node ( 120 ) configured to periodically generate and transmit at least one reception definition. Each reception definition indicates a time and manner in which the node will operate to receive information messages.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 12/174,512 filed Jul. 16, 2008, now U.S. Pat. No. 7,623,897which, in turn, is a continuation of U.S. patent application Ser. No.10/328,566 filed Dec. 23, 2002, now U.S. Pat. No. 7,421,257, which, inturn, is a continuation-in-part of U.S. patent application Ser. No.09/998,946 filed Nov. 30, 2001, now U.S. Pat. No. 7,020,501, the entirecontents of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

A. Field of the Invention

The present invention relates generally to wireless communicationsnetworks and, more particularly, to receiver scheduling in ad hocwireless communications networks.

B. Description of the Related Art

Conventionally, an ad hoc wireless network includes a variable number ofcommunications nodes, each node being equipped with a communicationstransceiver for conveying information messages throughout the network.While some nodes in the network are capable of performing networkrouting functions, other nodes serve exclusively as sources ordestinations for data traffic. These two types of nodes are commonlyreferred to, respectively, as routers and endpoints. During networkoperation, these routers and endpoints execute predefined algorithms andadhere to established networking protocols, which together enable thenodes to find one another, determine preferred paths through the networkfor data traffic, and detect and repair ruptures in the network ascommunication path characteristics change over time, or as nodes move,fail, experience changes in battery power, etc.

Certain ad hoc wireless networks employ a scheme known as receiverscheduling to conserve power in some or all of the network nodes, or tomake it more difficult for adversaries (e.g., hackers in a civiliancontext, or enemies in a military context) to monitor and disruptnetwork operation. In such receiver scheduling schemes, node receiversare selectively and intermittently turned off for some fraction of thetotal time that the overall network is operational. Consequently, eachnode is available and operating to receive information messages onlyduring prescribed periods, and some form of receiver scheduling isemployed to ensure that the various network nodes are in agreement as towhen they can transmit information messages to one another.

Conventionally, receiver scheduling is accomplished using some form ofTime Division Multiple Access, or TDMA, plan. While there are manyvariants of TDMA receiver scheduling, all such schemes share a commonbasic principle. Specifically, such TDMA plans divide network operatingtime into a number of predefined time slots and, during each time slot,certain network nodes are appointed to power up their receivers toaccept incoming information messages. By sharing a common referenceclock, as well as a common receiver appointment schedule, all of thenodes in the network are informed as to when they are able tosuccessfully transmit messages to neighboring nodes.

Typically, all of the nodes in such a network are preconfigured with asingle, network-encompassing TDMA receiver schedule. Alternatively, eachnode can transmit its own particular TDMA receiver schedule to othernodes during network operation. For example, a node can generate its ownTDMA receiver schedule at run time using a pseudo-random numbergenerator, or PRNG, and then transmit a corresponding PRNG seed toneighboring nodes (since, assuming all nodes are in agreement as to howto construct a TDMA receiver schedule from a PRNG stream, a single PRNGseed unambiguously defines a unique TDMA receiver schedule).

While these methods do achieve the stated goal of providing receiverscheduling in ad hoc wireless networks, they also have certaindrawbacks. For example, in each of the above mentioned TDMA schemes, thestart times and durations of the TDMA time slots are fixed.Consequently, each node is restricted with respect to the start timesand durations of its reception intervals. Such rigidity inevitablyresults in inefficiencies, as message transmission intervals are notalways precise multiples of a time slot, and thus portions of time slotssometimes go unused. Moreover, the fixed nature of the time slots canaid adversaries in attempts to monitor and disrupt network operation(i.e., the start times and durations of the time slots are not variableswith which an adversary must contend). As a result, a need exists for amore flexible, efficient, and robust receiver scheduling scheme.

SUMMARY OF THE INVENTION

Systems and methods consistent with the present invention address thisand other needs by having nodes in an ad hoc wireless networkcontinually generate and broadcast next, or pending, portions of theirrespective receiver schedules.

In accordance with the purpose of the invention as embodied and broadlydescribed herein, a wireless network includes a node that periodicallygenerates and transmits at least one reception definition. Eachreception definition indicates a time and manner in which the node willbe available and operating to receive information messages.

In another implementation consistent with the present invention, a nodeincluding a memory and a processor is disclosed. The processor generatesa local receiver schedule including a number of reception definitions,periodically modifies the local receiver schedule, and transmits theprevailing local receiver schedule together with information messagesbound for other nodes in the network.

In yet another implementation consistent with the present invention, amethod for performing receiver scheduling at a node in a wirelessnetwork is disclosed. The method includes generating a local receiverschedule at the node, the local receiver schedule including a number ofreception definitions. Each reception definition indicates a time andmanner in which the node will operate to receive information messagesfrom other nodes in the network. The method further includesperiodically updating the local receiver schedule at the node, andperiodically transmitting a most recently updated local receiverschedule from the node to other nodes in the network.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of this specification, illustrate an embodiment of the inventionand, together with the description, explain the invention. In thedrawings,

FIG. 1 depicts an exemplary ad hoc wireless network in which systems andmethods consistent with the present invention may be implemented;

FIG. 2 depicts an exemplary node, according to embodiments of thepresent invention, for use in the wireless network of FIG. 1;

FIG. 3 depicts an effective coverage area of a node of the wirelessnetwork of FIG. 1, as well as a number of actual and potentialneighboring nodes within the effective coverage area;

FIG. 4 is a flowchart depicting an exemplary method for developing andmaintaining a local receiver schedule according to embodiments of thepresent invention;

FIG. 5 is a flowchart depicting an exemplary method for disseminatinglocal receiver schedules according to embodiments of the presentinvention;

FIG. 6 is a flowchart depicting an exemplary implementation of thereceiver schedule development and maintenance method of FIG. 4;

FIG. 7 depicts an exemplary receiver schedule message that can be usedin conjunction with the implementation of FIG. 6; and

FIG. 8 depicts an exemplary local receiver schedule database that can beused to store receiver schedule information according to embodiments ofthe present invention.

DETAILED DESCRIPTION

The following detailed description of the invention refers to theaccompanying drawings. The same reference numbers in different drawingsmay identify the same or similar elements. Also, the following detaileddescription does not limit the invention. Instead, the scope of theinvention is defined by the appended claims and equivalents.

Generally, ad hoc wireless networks according to the invention includenodes that continually generate and broadcast next, or pending, portionsof their respective receiver schedules. In exemplary embodiments,network nodes transmit these pending schedules along with data trafficto other nodes in the network, and each node maintains a local receiverschedule database, including its own pending receiver schedule, as wellas any pending receiver schedules received from other network nodes. Tospeed the dissemination of receiver schedule information throughout thenetwork, nodes can transmit not only their own pending receiverschedules, but also those pending receiver schedules received from othernetwork nodes.

Since the pending receiver schedules for the various nodes areindependently generated, continually updated, and rapidly disseminated,each node is free to set its receiver schedule without consideration forany predefined time slot plan. Consequently, embodiments of theinvention provide flexible and efficient communications, as each networknode can dynamically adjust the amount of time its receiver is on andavailable. For example, a node can adjust its receiver duty cycle basedon the type of activity the node is performing, the prevailing datatraffic rate, the number of other nodes within communication range, etc.Additionally, each node can adjust the duration of individual receptionintervals to accommodate transmissions of varying length (e.g., shortercontrol packets or longer data packets). Advantageously, suchflexibility in reception interval duration also makes it more difficultfor adversaries to monitor and jam communications. This is particularlytrue when, as is described hereinafter, pseudo-random techniques areused to establish start times and channels for the reception intervals.

Exemplary System

FIG. 1 is a diagram of an exemplary network 100 in which systems andmethods consistent with the present invention can be implemented. Asshown, network 100 can include a number of endpoint devices 110, as wellas a number of intermediary nodes 120. Endpoint devices 110 can, forexample, include various known devices, such as mainframe computers,minicomputers, workstations, personal computers, laptops, personaldigital assistants, mobile telephones, handheld radios, or the like,capable of exchanging information with other devices. Additionally,intermediary nodes 120 can, for example, include various known devices,such as ground, airborne, underwater, and/or satellite basedtransceivers (employing radio, infrared, microwaves, acoustics, etc.),or the like, capable of passing or forwarding information from onedevice to another. Although, for sake of simplicity, two endpointdevices 110 and six intermediary nodes 120 are shown in FIG. 1, it willbe understood that exemplary network 100 can in fact include any numberof endpoint devices 110 and any number of intermediary nodes 120. Itwill also be appreciated that, although all endpoint devices 110 andintermediary nodes 120 appear stationary in FIG. 1, some or all endpointdevices 110 and intermediary nodes 120 can be, and often are, mobile inpractice.

In operation, endpoint devices 110 (also referred to hereinafter assource and/or destination devices) communicate with one another bytransmitting information messages via intermediary nodes 120 (alsoreferred to hereinafter as relays or routers). For example, as is shownin FIG. 1, a first endpoint device 110, labeled X, can exchangeinformation messages with a second endpoint device 110, labeled Y, via acommunication path including any or all of six intermediary nodes 120,labeled A through F. As is well known in the art, the informationmessages can be conveyed, for example, by way of data and controlpackets, and the precise path (i.e., the particular chain ofintermediary nodes 120) used to convey any given packet, or collectionof packets, can be determined via routing algorithms operating withinintermediary nodes 120. As is also well known in the art, suchalgorithms can, for example, adapt to accommodate node movements, nodefailures, changes in the physical communication paths betweenintermediary nodes 120, etc.

A network such as that depicted in FIG. 1 is often referred to in theart and hereinafter as an ad hoc wireless network. The descriptor“wireless” is used to indicate the fact that communication betweenintermediary nodes 120 is typically, though not always, via wirelesslinks. Additionally, the descriptor “ad hoc” is used to indicate thehighly flexible and portable nature of the network. In other words,because the nodes in such a network are typically mobile and thus able,indeed often expected, to intermittently join and leave the network, thenetwork can be quickly established in a particular place, at aparticular time, and for a particular purpose, and then just as quicklydisband when necessary or desired.

It will be appreciated, however, that these aspects of exemplary network100 of FIG. 1 are not requisite for operation of the receiver schedulingtechniques of the present invention. For example, for purposes of thepresent invention, any or all of the various endpoint devices 110 andintermediary nodes 120 of network 100 can be stationary or mobile.Additionally, the link between any two intermediary nodes 120, as wellas that between any endpoint device 110 and any intermediary node 120,can be wired, wireless, optical, etc. Moreover, while the endpointdevices 110 and intermediary nodes 120 are shown as separate devices inFIG. 1, it will be appreciated that in certain implementations, anendpoint device 110 can also perform the functions of an intermediarynode 120, and vice versa. Accordingly, and as will be appreciated bythose of ordinary skill, the invention is not limited to any specifichardware configuration.

FIG. 2 is an exemplary diagram of an intermediary node 120 according toone implementation consistent with the present invention. As shown, node120 can include a processor 210, a clock 220, a power supply 230, atransmitter 240, a receiver 245, a radio frequency (RF) modulator 250, aRF demodulator 255, RF antennae 260, a random access memory (RAM) 270, aread only memory (ROM) 275, a parallel communications port 280, and aserial communications port 285. As is well known, these components canbe connected via one or more communication buses (not shown) andconfigured in any number of known ways to accomplish transmission,reception, and processing of information packets.

For example, processor 210 can include any type of conventionalprocessor or microprocessor that interprets and executes instructions,and clock 220 can include any type of conventional timing circuitry fortracking a current time used in transmitting and receiving packets.Alternatively, processor 210 can include one or more applicationspecific integrated circuits, as well as combinational logic, or thelike, and clock 220 can include one or more counters and/or a globalpositioning system (GPS) receiver to provide a local time base that issynchronized with time bases used by other network components.

Power supply 230 can include conventional transformer/rectifier/filtercircuitry, or the like, for providing power to the various components ofnode 120. Additionally, or in the alternative, power supply 230 caninclude a portable generator, a battery, fuel cell, or the like, forproviding power in mobile contexts. Where power supply 230 includes abattery, the battery can be rechargeable, and any known rechargingmechanism can be used (e.g., solar power).

Transmitter 240 and receiver 245 can utilize conventional wirelesstechniques to communicate packets to and from other devices (e.g., toand from other nodes 120) via, respectively, RF modulator 250 and RFdemodulator 255 (RF modulator 250 and RF demodulator 255 being coupledto RF antennae 260). For example, transmission and reception can beaccomplished using any known time, frequency, or code division multipleaccess scheme (e.g., any known TDMA, FDMA, CDMA, ultrawideband (UWB)communication technique or any combination thereof). While transmitter240 and receiver 245 are shown as separate components in FIG. 2, it willbe appreciated that they can instead take the form of a singletransceiver. It will also be appreciated that RF antennae 260 caninclude any directional, multi-directional, or omni-directional antennaor antenna array.

RAM 270 can include a conventional RAM device or any other known dynamicstorage device that stores information and/or instructions for use byprocessor 210. Additionally, ROM 275 can include a conventional ROMdevice or any other known static storage device that stores informationand/or instructions for use by processor 210. Instructions used byprocessor 210 can also, or alternatively, be stored in any other knowncomputer-readable medium, including one or more memory devices and/orcarrier waves.

Communications ports 280, 285 can, for example, utilize known forms ofwired communication to enable exchange of information packets betweennode 120 and other devices (e.g., an endpoint device 110). For example,parallel port 280 can provide a standard Ethernet connection, and serialport 285 can provide a standard RS-232 or USB connection. Alternatively,communications ports 280, 285 can be combined in a single device and caninclude any known mechanism enabling the node 120 to communicate withother devices via any known type of wired, wireless, or optical link.

From the foregoing description, it will be apparent that, although theyare not all shown in FIG. 2, a variety of known component configurationsare consistent with the present invention. For example, as is well knownin the art, node 120 can include dual partitions (e.g., dual processors,dual transceivers, etc.) separated by one or more cryptographic units toprovide added security (e.g., in certain military applications).Additionally, hardwired circuitry can be used in place of, or incombination with, software instructions to implement processesconsistent with the present invention. Accordingly, and as will beappreciated by those of ordinary skill, the present invention is notlimited to any specific hardware and/or software configuration.

During node operation, processor 210 works in conjunction with certainof the other node components (e.g., clock 220, transmitter 240, receiver245, and communications ports 280, 285) to effect the above describedpacket transmission, reception, and routing, as well as the hereinafterdescribed receiver scheduling techniques of the present invention. To doso, processor 210 can, for example, execute a series of softwareinstructions retrieved from RAM 270, or from another suitablecomputer-readable medium. The software instructions can be loaded intoRAM 270 (or into another suitable computer-readable medium) from anyother suitable computer-readable medium, such as ROM 275, or from anexternal device via communication ports 280, 285 or receiver 245.

In order to conserve power, and/or to provide added network security,processor 210 can periodically power off receiver 245 during networkoperation. This practice, in combination with the fact that intermediarynodes 120 are generally free to join and leave network 100, makes itdesirable, if not necessary, that active nodes 120 (i.e., thoseintermediary nodes 120 actually present and operating in the network ata given time) be informed as to when neighboring nodes 120 are presentand available for communication. FIG. 3 illustrates this aspect of adhoc wireless network 100 of FIG. 1.

In FIG. 3, exemplary network 100 is shown to include a large number ofintermediary nodes 120, and solid lines connecting certain pairs ofnodes 120 are used to indicate that the two nodes in each connected pairare aware of, and are able to communicate with, one another. Acommunication range of a particular intermediary node 120, labeled I inFIG. 3, is depicted as a dashed circle surrounding the particular nodeI. The range can, for example, represent the effective coverage area,antenna orientation, beam patterns, etc. of a radio transmitter-receivercombination such as that shown in FIG. 2. It will be appreciated,however, that the communication range will not typically be circular inpractice. The precise shape of the coverage area will depend, forexample, on terrain, reflections from surrounding objects, wirelessinterference, etc.

In FIG. 3, six neighboring nodes 120 are positioned within thecommunication range of the particular node I. Of these six neighboringnodes 120, only three nodes, labeled A₁-A₃, are shown to be mutuallyaware of, and thus able to communicate with, the particular node I(i.e., these three nodes are “actual” neighbors of the particular node1). While the remaining three neighboring nodes, labeled P₁-P₃, do fallwithin the communication range of the particular node I, they are notmutually aware of, and are thus unable to communicate with, theparticular node I (i.e., they are merely “potential” neighbors of theparticular node I). The three neighboring nodes labeled P₁-P₃ can, forexample, represent nodes that have just entered and/or powered up withinthe communication range of the particular node I.

FIG. 3 thus demonstrates the importance of continually informing networknodes as to which neighboring nodes are available for communication. Inother words, it is desirable that the particular node I be made aware ofthe three newly available nodes P₁-P₃, and vice versa, so that the nodescan potentially route information messages more directly and efficientlythrough network 100. Additionally, the particular node labeled I shouldbe informed whenever known neighbors (e.g., the three nodes labeledA₁-A₃) power down, leave the area, or otherwise become unavailable forcommunication. Moreover, given that even the known and active neighborsof the particular node I can intermittently turn their receivers off asnoted above, it is desirable that the particular node I be kept informedof the precise times the neighboring nodes will be available andoperating to receive information messages. The present inventionprovides these and other advantages via novel receiver schedulingtechniques described hereinafter.

Exemplary Processing

Generally, receiver scheduling, according to implementations consistentwith the principles of the present invention, is achieved by configuringnetwork nodes 120 to continually generate and broadcast next, orpending, portions of their respective receiver schedules whenever nodes120 are active and participating in the network. Each node 120 transmitspending schedule portions along with data traffic to other nodes 120,and maintains a database including its own and other pending receiverschedules. In this way, nodes 120 are kept continually abreast, not onlyof the arrival and departure of neighboring nodes 120, but also of thepending receiver schedules for active neighboring nodes 120. Moreover,because pending receiver schedules for different nodes 120 may begenerated independently of one another and then quickly disseminatedwithin the network, each node 120 is able to tailor its own receiverschedule in view of changing network conditions, and without regard tothe restrictive time slot limitations imposed by conventional receiverscheduling techniques.

FIG. 4 depicts an exemplary method, according to implementationsconsistent with the invention, of developing and maintaining a pendingreceiver schedule and a pending receiver schedule database within a node120 of an ad hoc wireless network. Additionally, FIG. 5 depicts anexemplary method, according to implementations consistent with theinvention, of disseminating receiver schedule information from such anode 120. In combination, the exemplary methods of FIGS. 4 and 5 providea complete receiver scheduling scheme in accordance with the principlesof the invention. It will be appreciated that the techniques describedwith respect to FIGS. 4 and 5 can be implemented using known hardwareand software configurations. For example, processor 210 of FIG. 2 cancarry out software instructions to perform the various acts described inFIGS. 4 and 5. Additionally, RAM 270 of FIG. 2 can be used within anetwork node 120 to store the receiver scheduling information generatedand disseminated in the processing of FIGS. 4 and 5. As noted above,however, the present invention is not limited to any specific hardwareand/or software configuration.

The processing described in FIG. 4 can, for example, be executed by anetwork node 120 upon joining an ad hoc wireless network such as that ofFIG. 1. As shown, processing can begin with node 120 creating andstoring a local pending receiver schedule (act 410). According to oneimplementation of the present invention, the local pending receiverschedule can include a finite number of reception definitions, whereeach reception definition includes a number of parameters that togetherindicate a specific time and manner in which node 120 will operate(e.g., power up and tune its receiver 245) to receive messagestransmitted by other nodes.

In practice, the precise number and type of parameters included in eachreception definition will depend upon the media and format used totransmit information messages between network nodes 120. For example, ininstances where packets are transmitted using a conventionalfrequency-hopping format, each reception definition can include areception starting time, a reception duration, and an appropriatecarrier frequency (i.e., information indicating, by way of practicalexample, that reception begins in 3.85 seconds at 42.356 MHz and lasts10 milliseconds). Since, for purposes of the present invention, anysuitable medium (including radio, infrared, microwave, etc.) and anysuitable format (including, TDMA, FDMA, CDMA, pulse width modulation,pulse code modulation, etc.) can be used to transmit messages betweennetwork nodes 120, it will be appreciated that a reception definitionconsistent with the invention can include any suitable combination ofparameters that sufficiently describe a unique reception instance for aparticular media and a particular format.

Additionally, the number of reception definitions included in the localpending receiver schedule can be set (and thereafter dynamicallyadjusted) depending, for example, upon the number of nodes 120participating or expected to participate in the network, the prevailingor expected volume of network traffic, etc. In other words, given thatthe local pending receiver schedule is disseminated to other networknodes (as is described below with respect to FIG. 5), and given thatthere is some, albeit small, overhead associated with thatdissemination, the size of the pending receiver schedule is chosen tomaximize network efficiency for a given context.

According to implementations of the invention, the parameter values(i.e., the times, channels, etc.) included in each reception definitioncan also be set in a number of ways. For example, the parameters can bepreset in node 120 or dynamically determined at node 120 during networkoperation based, for example, upon prevailing or predicted traffic flowat node 120, the number of neighboring nodes, the power remaining in thenode battery, some or all known schedules for other nodes in thenetwork, etc. Alternatively, where transmission security is an issue,the parameters can be set based on output of a pseudo-random numbergenerator (PRNG), or based on some measurable physical random process(e.g., thermal noise, radioactive decay, or the like).

Once created, the local pending receiver schedule can be stored as partof a local pending receiver schedule database (e.g., in RAM 270 of FIG.2). Thereafter, node 120 can analyze the local pending receiver scheduleto determine when and how the node's receiver 245 should next be turnedon and tuned to receive information messages from other network nodes120 (act 420). For example, the first reception definition in thepending receiver schedule can be retrieved from the pending receiverschedule database, and the parameters of the retrieved receptiondefinition can be used to control the next reception operation of node120. Thus, at the appropriate time and in the appropriate manner (forexample, as defined by the parameters of the retrieved receptiondefinition), node 120 can power up its receiver 245, tune to theappropriate frequency, and capture any information messages beingtransmitted to it (act 430).

In implementations consistent with the present invention, and as isdescribed in detail below with respect to FIG. 5, the messages receivedby node 120 can include pending receiver schedules for other networknodes 120. Accordingly, node 120 can extract any incoming receiverschedules and store them in the local pending receiver schedule database(e.g., for use in transmitting messages to the other nodes, as isdescribed below with respect to FIG. 5) (act 440). Thereafter, node 120can update its own pending receiver schedule (act 450). For example,node 120 can delete the reception definition used in act 430 from thepending receiver schedule, and append a new reception definition to thepending receiver schedule. The new reception definition can, forexample, be generated using the same techniques used to generatereception definitions for the initial local receiver schedule (e.g.,based on a PRNG output stream).

Additionally, it will be understood that a node may take the knownschedules of other nodes into account when preparing its own next, orpending, schedule. For instance, when node 120 updates its own pendingreceiver schedule (act 450), node 120 may ensure that its new receptiondefinition does not overlap or conflict with any definitions in theknown schedules for other nodes in the network as recorded in the localreceiver schedule database.

Once the local receiver schedule has been updated, processing can returnto act 420, and the above described cycle (i.e., acts 420 to 450) can berepeated as long as node 120 is active and participating in network 100.Thus, according to the exemplary process of FIG. 4, node 120 generatesand then continually updates its own pending receiver schedule, while atthe same time using the prevailing receiver schedule (i.e., the current,or most recently updated, pending receiver schedule) to controlreception of information messages (and any included pending receiverschedules) from other network nodes 120. The prevailing local receiverschedule can be disseminated to other nodes 120 in network 100 as isnext described with respect to FIG. 5.

FIG. 5 depicts an exemplary receiver schedule dissemination process thatcan be executed in parallel with the exemplary process described abovewith respect to FIG. 4. To maintain synchronization between theprocesses of FIGS. 4 and 5, node 120 can, for example, execute theprocess of FIG. 5 once during each node reception interval (e.g., onceeach time node 120 executes act 430 of FIG. 4). As shown, processing canbegin with node 120 examining the local pending receiver scheduledatabase (which is developed as described above with respect to FIG. 4,and which includes pending reception definitions for neighboring nodes,as well as pending reception definitions for the node itself) todetermine which neighboring node 120 will next be receiving (act 510).Node 120 can, for example, identify a next receiving node by locating aminimum, or earliest, start time across all database entries associatedwith neighboring nodes 120.

Once the next receiving neighbor has been established, node 120 candetermine whether any information messages (e.g., any control and/ordata packets) are bound for the next receiving node 120 (act 520). Node120 can make such determination using conventional techniques (i.e.,data traffic is received and queued at the node using well known trafficrouting methods). If no information messages are bound for the nextreceiving node 120, then processing can return to act 510, where node120 can again determine the next receiving node 120. However, ifinformation messages are bound for the next receiving node 120, thennode 120 can prepare receiver scheduling information for inclusion withsome or all of the outgoing information messages (act 530).

More specifically, node 120 can create a receiver scheduling message, orRSM, using information retrieved from the local receiver scheduledatabase. At a minimum, the RSM can include the prevailing local pendingreceiver schedule (developed as described above with respect to FIG. 4,and including a list of reception definitions for node 120 itself).Additionally, the RSM can include some or all of the pending receiverschedules, if any, that have been previously collected from neighboringnodes (i.e., during earlier occurrences of act 430 of FIG. 4). Forexample, when relatively few pending receiver schedules have beencollected (which will typically be the case in smaller networks), theRSM can include the local receiver schedule database in its entirety.However, in larger networks, inclusion of the entire receiver scheduledatabase may not be feasible. In such a case, node 120 can include aparticular subset of the collected pending receiver schedules in the RSM(e.g., using random selection, round-robin selection, etc., or some formof biased selection based, for example, on a preset ranking of nodeimportance, or on a dynamically adjusted node ranking based on observedtraffic flow, path characteristics, etc.).

Once the RSM is created, node 120 can include the RSM (e.g., as part ofa header) with some or all of the information messages bound for thenext receiving node (act 540). Thereafter, node 120 can transmit theRSM-laden messages to the next receiving node (at an appropriate timeand in an appropriate manner, as dictated by the reception definitionused to identify the next receiving node at act 510). Once the messageshave been transmitted, processing can return to act 510 (perhaps afterwaiting for the start of the next node reception at act 430 of FIG. 4),and the transmission cycle (i.e., acts 510 through 550) can be repeated.

Thus, an intermediary node 120 continually transmits its ownlocally-generated pending receiver schedule and, possibly, pendingreceiver schedules received from other nodes 120. Moreover, when eachone of a network of nodes 120 executes the processing described in FIGS.4 and 5 in combination, the result is a proliferation of up-to-datepending receiver schedules throughout the network. Consequently, it ispossible, especially in smaller networks, for a newly activated node 120to learn the prevailing receiver schedule for an entire network just byreceiving a single RSM-carrying information message. Even in largernetworks, very few messages are required to inform a newly activatednode 120 of most or all of the already active nodes 120 in the network(i.e., since different nodes will tend to forward different subsets ofpending receiver schedules, and since the newly activated node willlikely receive messages from more than one neighboring node).

It should be noted that conventional beaconing techniques can be used inconjunction with the processing described in FIGS. 4 and 5 to allow anewly arriving node (i.e., a node that has yet to receive even a singleRSM, and therefore knows nothing of the network it is trying to join) tosuccessfully receive or transmit a first message. According to suchbeaconing techniques, all network nodes 120 transmit beacons, includingreceiver scheduling information, at preset or pseudo-random times. Anewly arriving node 120 can thus power up its receiver 245 and listenfor beacons from nearby nodes 120. Once a beacon (and the includedreceiver schedule information) has been received, the newly arrivingnode 120 can proceed to function normally in the network.

To further illuminate the various features and advantages of thereceiver scheduling techniques of the present invention, FIG. 6 depictsa specific exemplary implementation of the schedule generation andmaintenance processing described in FIG. 4. The exemplary implementationis intended for use in a network in which a standard frequency-hoppingscheme is used to carry out communications between intermediary nodes(i.e., each transmission of an information message occurs on one of anumber of preset carrier frequencies). Also, the processing of FIG. 6presumes that it is desirable for successive transmissions to berandomized (e.g., for security purposes). Like the processing of FIG. 4,the processing of FIG. 6 can be executed within an intermediary node 120(e.g., via processor 210 of FIG. 2), and in parallel with thedissemination processing described in FIG. 5.

In FIG. 6, processing can begin with node 120 selecting a PRNG seedusing known techniques (act 610). Thereafter, node 120 can use the PRNGseed to generate a finite number N of reception definitions (act 620).More specifically, node 120 can generate a PRNG stream based on theselected PRNG seed (again using known techniques), and use the PRNGstream to establish a starting time and a carrier frequency for each ofthe N reception definitions. Additionally, node 120 can determine aduration for each of the N reception definitions (e.g., using the PRNGstream, or based upon observed network conditions as described abovewith respect to FIG. 4). As noted previously, the precise number N ofreception definitions can be set, either a priori or at run time, basedon expected or observed network conditions. Once the N receptiondefinitions are established, node 120 can store them (e.g., in RAM 270of FIG. 2) as a local pending receiver schedule for node 120 (act 630).

Thereafter, node 120 can select the first reception definition in thelocal pending receiver schedule to govern a next reception operation fornode 120 (act 640). Thus, at an appropriate time (as indicated by thestart time associated with the selected reception definition) and in anappropriate manner (as indicated by the duration and the carrierfrequency associated with the selected reception definition), node 120powers up and tunes its receiver to accept any information messagesbeing transmitted to node 120 (act 650). As described above with respectto FIG. 4, the received information messages can include receiverschedule messages, which node 120 extracts and stores for use intransmitting messages to neighboring nodes. If the timing parametersincluded with the incoming receiver schedule messages are given inrelative terms (e.g., a start time of x seconds indicating that theassociated reception will begin x seconds after the reception definitionwas transmitted), then node 120 can map the incoming timing parametersto its own time base prior to storing them. Alternatively, if networknodes 120 share a common time base (e.g., via GPS receivers), thentiming parameters can be given in absolute network time, and no mappingmay be necessary.

Once reception of incoming messages is concluded, and once any incomingreceiver schedule messages have been extracted and stored, node 120 canupdate the local pending receiver schedule (acts 660 and 670). Morespecifically, node 120 can use the PRNG stream to generate a newreception definition (i.e., a new random start time and a new randomcarrier frequency, as well as a new duration which can be set eitherrandomly or strategically), and then modify the local pending receiverschedule by deleting the first reception definition (i.e., thedefinition just selected and used in acts 640 and 650, respectively) andappending the newly generated reception definition. Thereafter,processing can return to act 640, and the foregoing cycle (i.e., acts640 through 670) can be repeated as long as node 120 is present andactive in the network. Thus, node 120 effectively generates a rollingwindow of N pending reception definitions, each successive definitionincluding a pseudo-randomly generated start time, duration, and carrierfrequency.

At the same time, node 120 can disseminate this rolling window using theexemplary process described above with respect to FIG. 5. In otherwords, node 120 can include the prevailing N reception definitions inreceiver schedule messages that are in turn included with informationmessages bound for other network nodes. As described in detail above,the outgoing receiver schedule messages can also include pendingreceiver schedules previously collected from other network nodes. Thus,a receiver schedule message for the exemplary embodiment depicted inFIG. 6 can appear as shown in FIG. 7.

In FIG. 7, exemplary receiver schedule message 700 can include atransmitting node identification field 710, as well as a transmittingnode receiver schedule field 720. As shown, transmitting node receiverschedule 720 includes N reception definitions, each reception definitionincluding a reception interval (i.e., a start time and a duration) and areception channel (i.e., a carrier frequency). Additionally, theexemplary receiver schedule message 700 can optionally include anadditional schedule count field 730, additional pending receiverschedule fields 740, and an error correction field 750.

Additional schedule count field 730 can indicate a number, if any, ofadditional pending receiver schedule fields 740 to follow. As shown,each additional pending receiver schedule 740 can include a nodeidentification field and an associated collection of N receptiondefinitions (each definition in turn including an associated intervaland channel). Error correction field 750 can include information toensure accurate transmission of the receiver schedule message 700. Notealso that the receiver schedule message 700 can be encrypted using knowntechniques to provide added security (e.g., network nodes can use ashared encryption key to code and decode messages as they aretransmitted and received).

Advantageously, receiver schedule message 700 can be used in theexemplary processes of FIGS. 5 and 6 to provide the above describedbenefits of performing receiver scheduling in accordance with theprinciples of the invention. For example, the pseudo-random nature ofthe reception start times and channels provides significant protectionagainst network adversaries. Moreover, the reception durations can beset, for example, to accommodate varying network conditions and/orvarying incoming packet lengths.

As described above, node 120 of FIG. 2 can construct a receiver schedulemessage, such as receiver schedule message 700 of FIG. 7, from receiverschedule data stored within a local receiver schedule database (thelocal receiver schedule database in turn residing, for example, withinRAM 270 of FIG. 2). FIG. 8 depicts an exemplary local receiver scheduledatabase 800 consistent with implementations of the present invention.As shown, local receiver schedule database 800 includes a number M ofpending receiver schedules 810. A first one of pending receiverschedules 810 can, for example, be a local pending receiver schedule fornode 120 of FIG. 2, and all other pending receiver schedules 810 can,for example, be pending receiver schedules for other network nodes 120.

As shown, each pending receiver schedule 810 includes a nodeidentification field (used to identify a particular node 120 to whichschedule 810 applies), a reception definition count field (used toindicate a number N of reception definitions included in schedule 810),and a reception definition parameter count field (used to indicate anumber L of parameters included in each reception definition in schedule810). Additionally, each schedule 810 includes an N×L array of receptiondefinition parameters (i.e., N rows of L parameters, each rowcorresponding to a single reception definition).

As described above, the medium and mode of communication between networknodes 120 will, in practice, dictate the number and type of parametersincluded in each reception definition. For example, in a standard radiofrequency-hopping system, each reception definition can include justthree parameters (i.e., a start time, a duration, and a carrierfrequency). Note also that the number N of reception definitions perschedule, as well as the number L of parameters per receptiondefinition, can be fixed and identical for all network nodes 120. If so,then pending receiver schedules 810 need not include the receptiondefinition count field or the reception definition parameter count fieldshown in FIG. 8.

CONCLUSION

Systems and methods consistent with the present invention includenetwork nodes that continually generate and broadcast next, or pending,portions of their respective receiver schedules. According to exemplaryembodiments, certain aspects of the pending schedule portions aregenerated and updated in a pseudo-random fashion, and the pendingschedule portions are transmitted along with data traffic among thenetwork nodes. Each network node maintains a local receiver scheduledatabase, including its own pending receiver schedule, as well as anypending receiver schedules received from other network nodes. To speeddissemination of receiver schedule information throughout the network,nodes transmit not only their own pending receiver schedules, but alsothose pending receiver schedules received from other network nodes.Since the pending receiver schedules for the various nodes areindependently generated, continually updated, and rapidly disseminated,each node is able to set its own receiver schedule without considerationfor any predefined scheduling plan. Embodiments are thus able to provideflexible, efficient and robust communication.

The foregoing description of preferred embodiments of the presentinvention provides illustration and description, but is not intended tobe exhaustive or to limit the invention to the precise form disclosed.Modifications and variations are possible in light of the aboveteachings or may be acquired from practice of the invention. Forexample, while series of acts have been described with regard to FIGS.4, 5 and 6, the order of the acts can be varied in other implementationsconsistent with the present invention. Moreover, non-dependent acts canbe implemented in parallel.

No element, act, or instruction used in the description of the presentinvention should be construed as critical or essential to the inventionunless explicitly described as such. Also, as used herein, the article“a” is intended to include one or more items. Where only one item isintended, the term “one” or similar language is used. The scope of theinvention is not limited to the foregoing description, and is insteaddefined by the claims and their equivalents.

1. An apparatus, comprising: a node configured to: periodically generateand transmit at least one reception definition, each of the at least onereception definition indicating a time in which the node will operate toreceive information messages, generate a local receiver scheduleincluding the at least one reception definition, periodically modify thelocal receiver schedule, transmit a prevailing local receiver scheduleto one or more network nodes, receive incoming information messages inaccordance with a first reception definition, discontinue use of thefirst reception definition in association with the local receiverschedule, generate a new reception definition, and use the new receptiondefinition in association with the local receiver schedule.
 2. Theapparatus of claim 1, wherein, when generating the at least onereception definition, the node is configured to derive parametersdelineating each of the at least one reception definition viapseudo-random number generation.
 3. The apparatus of claim 1, wherein,when generating the at least one reception definition, the node isconfigured to derive parameters delineating each of the at least onereception definition via physical random number generation.
 4. Theapparatus of claim 1, wherein the node transmits the new receptiondefinition by including the new reception definition with informationmessages bound for other network nodes.
 5. The apparatus of claim 1,wherein the node is further configured to receive and subsequentlytransmit reception definitions generated and transmitted by other nodes.6. The apparatus of claim 5 wherein the node generates the at least onereception definition based on at least one of the received receptiondefinitions.
 7. The apparatus of claim 5, wherein the node includes areceiver message database configured to store the reception definitionsgenerated by the node and the reception definitions received from theother nodes.
 8. The apparatus of claim 7, wherein the receiver messagedatabase is configured to store a data structure including at least onenode receiver schedule.
 9. The apparatus of claim 8, wherein each nodereceiver message in the data structure includes a node identificationfield and an array of reception definitions.
 10. The apparatus of claim9, wherein each reception definition in the data structure includes areception start time, a reception duration, and a reception channel. 11.An apparatus, comprising: a node configured to: periodically generateand transmit at least one reception definition, each of the at least onereception definition indicating a time in which the node will operate toreceive information messages, and receive and subsequently transmitreception definitions generated and transmitted by other nodes; whereinthe node includes a receiver message database configured to store thereception definitions generated by the node and the receptiondefinitions received from the other nodes; wherein, when periodicallytransmitting reception definitions, the node is configured to: analyzethe receiver message database to determine a next receiving node in anetwork, determine whether any information messages are bound for thenext receiving node, and transmit at least a subset of the receptiondefinitions stored in the receiver message database to the nextreceiving node.
 12. A node, comprising: a memory, and a circuitry incommunication with the memory, the circuitry configured to cause thenode to: generate one or more reception definitions, each receptiondefinition indicating a time and manner associated with informationmessage receipt by the node, update the one or more receptiondefinitions, and cause a reception definition message to be transmittedto one or more other nodes in communication with a wireless network;wherein, in association with the updating the one or more receptiondefinitions, the circuitry is configured to cause the node to: receiveincoming information messages in accordance with a particular receptiondefinition, discontinue use of the particular reception definition, andgenerate a new reception definition for use.
 13. The node of claim 12,wherein the node is operable so as to identify a next receiving nodefrom among the one or more other nodes.
 14. The node of claim 13,wherein the node is operable so as to determine whether a particularinformation message is bound for the identified next receiving node. 15.The node of claim 14, wherein the node is operable such that, when theparticular information message is bound for the identified nextreceiving node, the circuitry is configured to cause the receptiondefinition message to be transmitted together with the particularinformation message to the identified next receiving node.
 16. The nodeof claim 13, wherein the node is operable such that, when identifyingthe next receiving node, the circuitry is configured to analyze adatabase.
 17. The node of claim 16, wherein the node is operable suchthat, when identifying the next receiving node, the circuitry isconfigured to analyze the database to determine an earliest start timeamong stored reception definitions associated with the one or more othernodes.
 18. The node of claim 13, wherein the circuitry is configured tocause the reception definition message to be transmitted together with aparticular information message to the identified next receiving node,and additionally cause reception definitions associated with the one ormore other nodes to be transmitted together with the particularinformation message to the identified next receiving node.
 19. The nodeof claim 12, further comprising a database configured to store the oneor more reception definitions generated by the node.
 20. The node ofclaim 12, further comprising a database configured to store one or moreof the reception definitions that are received by the node from the oneor more other nodes.
 21. The node of claim 20, wherein the circuitry isconfigured to cause the node to generate the reception definitionmessage based on the one or more received reception definitions.
 22. Thenode of claim 12, further comprising a database that is configured tostore a data structure.
 23. The node of claim 22, wherein the datastructure includes a node identification field.
 24. The node of claim22, wherein the data structure includes an array of receptiondefinitions.
 25. The node of claim 24, wherein each reception definitionin the array includes a reception start indicator.
 26. The node of claim25, wherein each reception definition in the array includes a receptionduration.
 27. The node of claim 25, wherein each reception definition inthe array includes a reception channel.
 28. The node of claim 12,wherein the circuitry includes hardware circuitry.
 29. The node of claim12, wherein the circuitry is part of an application-specific integratedcircuit.
 30. The node of claim 12, wherein the time includes a durationtime period.
 31. The node of claim 30, wherein the circuitry isconfigured to cause the node to power down a receiver after the durationtime period has lapsed.
 32. The node of claim 12, wherein the mannerindicates a duration.
 33. The node of claim 12, wherein the mannerindicates a channel.
 34. The node of claim 33, wherein the channelincludes a carrier frequency.
 35. The node of claim 12, wherein the nodeis operable such that at least one aspect of the reception definitionmessage is based on a pseudo-random number.
 36. The node of claim 35,wherein the aspect includes the time.
 37. The node of claim 35, whereinthe aspect includes a channel.
 38. The node of claim 35, wherein theaspect includes a duration.
 39. The node of claim 12, wherein the nodeis operable such that at least one aspect of the reception definitionmessage is based, at least in part, on a physical random number.
 40. Thenode of claim 39, wherein the aspect includes the time.
 41. The node ofclaim 39, wherein the aspect includes a channel.
 42. The node of claim39, wherein the aspect includes a duration.
 43. The node of claim 12,wherein the node is operable to receive the incoming informationmessages by powering up a receiver.
 44. The node of claim 12, whereinthe node is operable to receive the incoming information messages bytuning a receiver.
 45. The node of claim 12, wherein the node isoperable such that the one or more reception definitions is updatedmultiple times.
 46. The node of claim 12, wherein the node is operablesuch that the one or more reception definitions is periodically updated.47. The node of claim 12, wherein the node is operable to function in anetwork environment that includes a first node, an intermediate node,and a second node, wherein the first node is adapted to communicate withthe second node via the intermediate node, where the node is adapted tooperate as one of: the first node, the second node, or the intermediatenode.
 48. The node of claim 12, wherein the time is included with theone or more reception definitions for power conservation purposes. 49.The node of claim 48, wherein the node is operable to function in anetwork environment that includes a plurality of nodes, where a nodereceiver of at least one of the plurality of nodes is powered off basedon the one or more reception definitions for the power conservationpurposes.
 50. The node of claim 12, wherein the node is operable suchthat a plurality of the reception definitions are included in thereception definition message, and the reception definition messageincludes a single message.
 51. The node of claim 12, wherein the node isoperable such that a single one of the reception definitions istransmitted in a single message.
 52. The node of claim 12, wherein thereception definition message is a schedule message.
 53. The node ofclaim 52, wherein the schedule message is accompanied by a checksum. 54.The node of claim 52, wherein the schedule message includes a pluralityof the reception definitions associated with different nodes.
 55. Thenode of claim 52, wherein the schedule message includes a plurality ofthe reception definitions associated with different communicationmechanisms.
 56. The node of claim 52, wherein the schedule messageincludes one or more reception definitions received from one or moredifferent nodes.
 57. The node of claim 12, wherein the receptiondefinition message includes an identifier of the node.
 58. The node ofclaim 12, wherein the reception definition message includes anidentifier of at least one other node.
 59. The node of claim 58, whereinthe reception definition message includes another node receptiondefinition which is associated with the at least one other node.
 60. Thenode of claim 59, wherein the node is operable such that the anothernode reception definition is received from the at least one other node.61. The node of claim 59, wherein the another node reception definitionincludes a reception start indicator associated with the at least oneother node.
 62. The node of claim 59, wherein the another node receptiondefinition includes a reception duration associated with the at leastone other node.
 63. The node of claim 59, wherein the another nodereception definition includes a reception channel associated with the atleast one other node.
 64. The node of claim 12, wherein the circuitry isconfigured such that the one or more reception definitions istransmitted together with at least one information message.
 65. The nodeof claim 12, wherein the node is a component of a mobile phone.
 66. Thenode of claim 12, wherein the node is adapted for being battery-powered.67. The node of claim 12, wherein the node is a component of a laptop.68. The node of claim 12, wherein the node includes a serial port. 69.The node of claim 12, wherein the node is capable of being notified whenat least one other node is unavailable for communication.
 70. The nodeof claim 12, wherein the node is operable to function in a networkenvironment that includes an ad-hoc wireless network.
 71. The node ofclaim 12, wherein a number of the reception definitions is dynamicallydetermined.
 72. The node of claim 12, wherein the node is operable tocommunicate via a plurality of antennae in an array.
 73. The node ofclaim 12, wherein the node is operable to interface a plurality ofantennae.
 74. The node of claim 12, wherein the reception definitionmessage is a next message.
 75. The node of claim 12, wherein thereception definition message is a pending message.
 76. The node of claim12, wherein the node is operable such that the reception definitionmessage is transmitted along with data traffic.
 77. The node of claim12, wherein the node is operable such that the one or more receptiondefinitions is transmitted along with at least one other receptiondefinition received from another node.
 78. The node of claim 77, whereinthe node is operable such that the one or more reception definitions andthe at least one other reception definition received from another node,are independently generated.
 79. The node of claim 12, wherein the nodeis operable such that the one or more reception definitions is generatedwithout consideration for a predefined time slot plan.
 80. The node ofclaim 12, wherein the node is operable such that the one or morereception definitions is capable of being flexibly generated withoutrestrictive time slot limitations.
 81. The node of claim 12, wherein thenode is operable such that the one or more reception definitions isgenerated so that a receiver duty cycle is modified.
 82. The node ofclaim 12, wherein the node is operable such that the one or morereception definitions is generated based on a type of activity the nodeis performing.
 83. The node of claim 12, wherein the node is operablesuch that the one or more reception definitions is generated based on aprevailing data traffic rate.
 84. The node of claim 12, wherein the nodeis operable such that at least one aspect of the one or more receptiondefinitions is based on a number of other nodes within communicationrange.
 85. The node of claim 12, wherein the node is operable such thatthe one or more reception definitions is generated so that a duration ofa reception interval is modified.
 86. The node of claim 12, wherein thenode is operable such that the one or more reception definitions isgenerated so that a duration of a reception interval is modified toaccommodate transmissions of varying length.
 87. The node of claim 12,wherein the node is operable such that the one or more receptiondefinitions is generated to accommodate communications of varyinglength.
 88. The node of claim 12, wherein the node is operable such thatthe one or more reception definitions is generated to accommodatetransmissions of shorter control packets.
 89. The node of claim 12,wherein the node is operable such that the one or more receptiondefinitions is generated to accommodate transmissions of longer datapackets.
 90. The node of claim 12, wherein the node is operable suchthat the one or more reception definitions is generated to make it moredifficult to monitor or jam communications.
 91. The node of claim 12,wherein the reception definition message includes a local receptiondefinition message.
 92. The node of claim 12, wherein the manner is thatin which the node will operate to receive the incoming informationmessages.
 93. The node of claim 12, wherein the node is capable ofoperating as an endpoint.
 94. The node of claim 12, wherein the node iscapable of operating as an intermediate node.
 95. The node of claim 12,wherein the node is operable such that at least one of the one or morereception definitions is updated a plurality of instances.
 96. The nodeof claim 12, wherein the node is operable such that at least one of theone or more reception definitions is updated periodically.
 97. The nodeof claim 12, wherein the reception definition message is a receiverschedule.
 98. The node of claim 12, wherein the node is operable suchthat at least one of the one or more reception definitions isdynamically generated.
 99. The node of claim 12, wherein the node isoperable such that at least one parameter value of at least one of theone or more reception definitions is dynamically determined.
 100. Thenode of claim 12, wherein the node is operable such that at least oneparameter value of at least one of the one or more reception definitionsis preset.
 101. The node of claim 12, wherein the node is capable ofoperating as a component of a router.
 102. The node of claim 12, whereinthe node is capable of operating as a component of a relay.
 103. Thenode of claim 12, wherein the node is capable of operating as acomponent of an endpoint that is a source device.
 104. The node of claim12, wherein the node is capable of operating as a component of anendpoint that is a destination device.
 105. The node of claim 12,wherein the node is designed to be stationary.
 106. The node of claim12, wherein the node is designed to be mobile.
 107. The node of claim12, wherein the node is operable such that a plurality of transmittedinformation messages are transmitted by way of at least one data packet.108. The node of claim 12, wherein the node is operable such that aplurality of transmitted information messages are transmitted by way ofat least one control packet.
 109. The node of claim 12, wherein the nodeis capable of operating as a component of a system including a globalpositioning system.
 110. The node of claim 12, wherein the node isoperable to cooperate with a global positioning system for providing alocal time base that is synchronized with a time base used by anothernetwork component.
 111. The node of claim 12, wherein the node isoperable such that at least one of the one or more reception definitionsis dynamically determined.
 112. The node of claim 12, wherein the nodeis operable such that at least one of the one or more receptiondefinitions is dynamically determined based on a number of nodesparticipating or expected to participate in the wireless network. 113.The node of claim 12, wherein the node is operable such that at leastone of the one or more reception definitions is dynamically determinedbased on a prevailing or expected volume of network traffic.
 114. Thenode of claim 12, wherein the node is operable such that at least one ofthe one or more reception definitions is dynamically determined tomaximize network efficiency for a given context.
 115. The node of claim12, wherein the node is operable such that at least one of the one ormore reception definitions is dynamically determined based on a numberof neighboring nodes.
 116. The node of claim 12, wherein the node isoperable such that at least one of the one or more reception definitionsis dynamically determined based on a power remaining in a node battery.117. The node of claim 12, wherein the node is operable such that atleast one of the one or more reception definitions is dynamicallydetermined based on one or more known schedules for the one or moreother nodes in the network.
 118. The node of claim 12, wherein the nodeis operable such that at least one of the one or more receptiondefinitions is dynamically determined based on a pseudo-random numbergenerator.
 119. The node of claim 12, wherein the node is operable suchthat at least one of the one or more reception definitions isdynamically determined based on a random number generator.
 120. The nodeof claim 12, wherein the node is operable such that the receptiondefinition message is transmitted to maintain synchronization.
 121. Thenode of claim 12, wherein at least one of the one or more receptiondefinitions includes at least one parameter that sufficiently describesa reception instance for a particular media.
 122. The node of claim 12,wherein at least one of the one or more reception definitions includesat least one parameter that sufficiently describes a reception instancefor a particular format.
 123. The node of claim 12, wherein the node isoperable such that a use of the particular reception definition isdiscontinued by deleting the particular reception definition.
 124. Thenode of claim 12, wherein the node is operable such that only a portionof a reception definition database is stored.
 125. The node of claim 12,wherein the node is operable such that only a portion of a receptiondefinition database is stored if the reception definition databaseexceeds a certain size.
 126. The node of claim 12, wherein the node isoperable such that a complete set of reception definitions for all nodesin the wireless network is capable of being communicated in connectionwith a single schedule message.
 127. The node of claim 12, wherein thenode is operable such that the reception definition message istransmitted in association with a beacon.
 128. The node of claim 12,wherein the node is operable such that the reception definition messageis transmitted in association with a beacon that is transmitted atpreset times.
 129. The node of claim 12, wherein the node is operablesuch that the reception definition message is transmitted in associationwith a beacon that is transmitted at pseudo-random times.
 130. The nodeof claim 12, wherein the node is operable such that the receptiondefinition message is transmitted in association with a beacon to allowa newly arriving node that has yet to receive any reception definitionmessage, to successfully receive or transmit a first informationmessage.
 131. The node of claim 12, wherein the node is operable suchthat the reception definition message is transmitted in association witha beacon to allow a newly arriving node to functional normally in thewireless network.
 132. The node of claim 12, wherein the node isoperable such that incoming timing parameters are mapped to a time baseof the node.
 133. The node of claim 12, wherein the node is operable soas to generate a rolling window of reception definitions.
 134. The nodeof claim 12, wherein the node is operable so as to generate a rollingwindow.
 135. The node of claim 12, wherein the reception definitionmessage includes an error correction field.
 136. The node of claim 12,wherein the reception definition message includes a parameter countfield.
 137. The node of claim 12, wherein the reception definitionmessage includes a reception definition count field.
 138. The node ofclaim 12, wherein the reception definition message is encrypted. 139.The node of claim 12, wherein the reception definition message includesa node identifier field.
 140. The node of claim 12, wherein thetransmission includes a broadcast communication.
 141. The node of claim12, wherein the node is operable such that at least one aspect of atleast one of the one or more reception definitions is independentlygenerated.
 142. The node of claim 12, wherein the reception definitionmessage includes at least one of the one more of the receptiondefinitions having a next status.
 143. The node of claim 12, wherein thereception definition message includes at least one of the one morereception definitions having a pending status.
 144. The node of claim12, wherein the reception definition message includes only a portion ofthe one more reception definitions.
 145. The node of claim 144, whereinthe node is operable such that the portion is selected based on the oneor more other nodes to which the reception definition message isdirected.
 146. The node of claim 12, wherein the node is operable suchthat a number of the one or more reception definitions is based on anumber of nodes participating in a network.
 147. The node of claim 12,wherein the node is operable such that a number of the one or morereception definitions is based on a number of nodes expected toparticipate in a network.
 148. The node of claim 12, wherein the node isoperable such that a number of the one or more reception definitions isbased on a prevailing volume of network traffic.
 149. The node of claim12, wherein the node is operable such that a number of the one or morereception definitions is based on an expected volume of network traffic.150. The node of claim 12, wherein the node is operable such that anumber of the one or more reception definitions is selected to maximizenetwork efficiency for a given context.
 151. The node of claim 12,wherein the node is operable such that a number of parameters of atleast one of the one or more reception definitions is based on a formatused to receive the incoming information messages.
 152. The node ofclaim 12, wherein the node is operable such that a type of parameters ofthe one or more reception definitions is based on a format used toreceive the incoming information messages.
 153. The node of claim 12,wherein the node is operable such that parameter values of the one ormore reception definitions are selected based on a number of the othernodes.
 154. The node of claim 12, wherein the node is operable such thatparameter values of the one or more reception definitions are selectedbased on a power remaining in a node battery.
 155. The node of claim 12,wherein the node is operable such that parameter values of the one ormore reception definitions are selected based on a schedule for at leastone of the other nodes.
 156. The node of claim 12, wherein the node isoperable such that generation or update of at least one of the one ormore reception definitions occurs in parallel with transmission of thereception definition message inclusive of at least one other of the oneor more reception definitions.
 157. The node of claim 12, wherein thenode is operable such that transmission of the reception definitionmessage is inclusive of at least one of the one or more receptiondefinitions that is selected based on a node ranking.
 158. The node ofclaim 12, wherein the node is operable such that transmission of thereception definition message is inclusive of at least one of the one ormore reception definitions that is selected based on a traffic flow.159. The node of claim 12, wherein the node is operable such thattransmission of the reception definition message is inclusive of atleast one of the one or more reception definitions that is selectedbased on a path characteristic.
 160. The node of claim 12, wherein thenode is operable such that transmission of the reception definitionmessage is inclusive of at least one of the one or more receptiondefinitions located in a header.
 161. The node of claim 12, wherein thetime and the manner are those in which the node is to receive theincoming information messages.
 162. The node of claim 12, wherein thetime and the manner are those in which the node is capable of receivingthe incoming information messages.
 163. The node of claim 12, whereinthe time includes a start time.
 164. The node of claim 12, wherein thetime is a relative time.
 165. The node of claim 12, wherein the time isan absolute time.
 166. The node of claim 12, wherein the manner includesat least one aspect other than the time.
 167. The node of claim 12,wherein the manner includes at least one aspect that is not timerelated.
 168. The node of claim 12, wherein the manner includes at leastone aspect that is time related.
 169. The node of claim 12, wherein thenode is operable such that the incoming information messages arereceived utilizing a time division multiple access format.
 170. The nodeof claim 12, wherein the node is operable such that the incominginformation messages are received utilizing a frequency divisionmultiple access format.
 171. The node of claim 12, wherein the node isoperable such that the incoming information messages are receivedutilizing both a time division multiple access format and a frequencydivision multiple access format.
 172. The node of claim 12, wherein thenode is operable such that the incoming information messages arereceived utilizing a pulse width modulation format.
 173. The node ofclaim 12, wherein the node is operable such that the incominginformation messages are received utilizing a pulse code modulationformat.
 174. The node of claim 12, wherein the manner indicates achannel that includes at least one carrier frequency.
 175. The node ofclaim 12, wherein the node is operable such that the update includesmodifying at least one of the one or more reception definitions. 176.The node of claim 12, wherein the node is operable such that the updateincludes deleting at least one of the one or more reception definitions.177. The node of claim 12, wherein the node is operable such that theupdate includes replacing one reception definition with anotherreception definition.
 178. The node of claim 12, wherein the node isoperable such that the update includes adding a new receptiondefinition.
 179. The node of claim 12, wherein the node is operable suchthat a node ranking is dynamically determined.
 180. The node of claim12, wherein, when causing the reception definition message to betransmitted to the one or more other nodes in communication with thewireless network, the circuitry is configured to cause the node to:identify a next receiving node from among the one or more other nodes inthe wireless network, determine whether an information message is boundfor the identified next receiving node, and when the information messageis bound for the identified next receiving node, cause the receptiondefinition message to be transmitted to the identified next receivingnode.
 181. The node of claim 180, further comprising a databaseconfigured to store the one or more reception definitions that aregenerated by the node and one or more other reception definitionsreceived by the node from the one or more other nodes in the wirelessnetwork.
 182. The node of claim 181, wherein the circuitry generates thereception definition message based on the other reception definitions.183. The node of claim 181, wherein, when identifying the next receivingnode, the circuitry is configured to cause the node to analyze thedatabase to determine an earliest start time among stored receptiondefinitions associated with other network nodes.
 184. The node of claim181, wherein, when causing the reception definition message to betransmitted to the identified next receiving node, the circuitry isconfigured to cause the node to additionally cause reception definitionsassociated with the one or more other network nodes to be transmitted tothe identified next receiving node.
 185. The node of claim 181, whereinthe database is configured to cause the node to store a data structureincluding at least one node receiver schedule.
 186. The node of claim185, wherein each node receiver schedule in the data structure includesa node identification field and an array of reception definitions. 187.The node of claim 186, wherein each reception definition in the datastructure includes a reception start time, a reception duration, and areception channel.
 188. The node of claim 12, wherein the node isoperable such that generation or update of at least one of the one ormore reception definitions occurs in parallel with transmission of thereception definition message.
 189. The node of claim 12, wherein thenode is operable to function in a network environment that includes afirst node, an intermediate node, and a second node, wherein the firstnode is adapted to communicate with the second node via the intermediatenode, where the node is adapted to operate as the first node, where thenode is further adapted to operate as the second node, where the node isadapted to even further adapted to operate as the intermediate node.190. The node of claim 12, wherein the node is operable to function in anetwork environment that includes a first stationary node and a secondmobile node, where the node is adapted to operate as the firststationary node, where the node is further adapted to operate as thesecond mobile node.
 191. The node of claim 12, wherein the circuitry isconfigured to power down a receiver based on the time of at least one ofthe one or more reception definitions.
 192. The node of claim 12,wherein the circuitry is further configured to cause the node to storein at least one data structure a plurality of the reception definitionsincluding one or more first reception definitions received by the nodefrom the one or more other nodes and one or more second receptiondefinitions generated by the node, the one or more first receptiondefinitions and the one or more second one or more reception definitionsbeing independently generated, each reception definition in the at leastone data structure including a reception start indicator, a receptionduration, and an identifier corresponding to at least one associatednode; wherein the node is operable to function in combination with anantennae array inclusive of a plurality of antennae capable ofcommunicating with the circuitry; wherein the node is capable of beingnotified when at least one other node is unavailable for communication;wherein the reception definition message includes only a portion of theone more reception definitions that are stored in the at least one datastructure; wherein the circuitry is further configured with a capabilityto cause the node to power down a receiver based on at least the time ofat least one of the one or more reception definitions; wherein thereception definition message includes a reception definition countfield.
 193. The node of claim 192, wherein the circuitry is furtherconfigured to cause the node to be operable such that a plurality of thereception definitions are identified in the reception definitionmessage, and the reception definition message includes a single message.194. The node of claim 192, wherein the portion is selected based on theone or more other nodes to which the reception definition message isdirected.
 195. The node of claim 192, wherein the node is operable suchthat the one or more reception definitions is generated substantiallywithout consideration for a predefined time slot plan.
 196. The node ofclaim 192, wherein the node is operable such that the one or morereception definitions is capable of being flexibly generatedsubstantially without restrictive time slot limitations.
 197. The nodeof claim 192, wherein the node is operable such that the one or morereception definitions is generated based on a type of activity the nodeis performing.
 198. The node of claim 192, wherein the node is operablesuch that the one or more reception definitions is generated toaccommodate transmissions of varying length.
 199. The node of claim 192,wherein the node is operable such that the one or more receptiondefinitions is generated to accommodate transmissions of shorter controlpackets.
 200. The node of claim 192, wherein the node is operable suchthat the one or more reception definitions is generated to accommodatetransmissions of longer data packets.
 201. The node of claim 192,wherein the node is operable such that the one or more receptiondefinitions is generated so that a receiver duty cycle is modified. 202.The node of claim 192, wherein the reception definition count fieldindicates a count of reception definitions included with the receptiondefinition message.
 203. The node of claim 192, wherein the antennae areomni-directional.
 204. The node of claim 192, wherein the antennae aremulti-directional.
 205. The node of claim 192, wherein the one or morereception definitions indicates a communication direction.
 206. The nodeof claim 12, wherein the manner includes connection-related information.207. The node of claim 12, wherein a node receiver of the node isadapted to be powered off based on the one or more reception definitionsfor power conservation purposes.
 208. The node of claim 12, wherein thereception definition message includes at least one of the one or morereception definitions that is associated with a plurality of differentnodes.
 209. The node of claim 12, wherein the reception definitionmessage includes at least one of the one or more reception definitionsthat is associated with a plurality of different communicationmechanisms.
 210. The node of claim 209, wherein the differentcommunication mechanisms include different communication channels. 211.The node of claim 12, wherein the one or more reception definitionsindicates a communication direction.
 212. The node of claim 12, whereinthe node is operable such that different aspects of at least one of theone or more reception definitions are independently generated bydifferent nodes.
 213. The node of claim 12, wherein the node is operablesuch that at least one first aspect of at least one of the one or morereception definitions is generated by a first node, and at least onesecond aspect of the at least one of the one or more receptiondefinitions is generated by a second node.
 214. A method, comprising:generating a receiver message at a node, the receiver message includingone or more reception definitions, each reception definition indicatinga time or manner in which the node is to receive information messages;modifying the receiver message at the node; and transmitting aprevailing receiver message from the node to one or more other nodes incommunication with a wireless network; wherein the modifying thereceiver message includes: receiving incoming information messages inaccordance with a particular reception definition, discontinuing use ofthe particular reception definition, and generating a new receptiondefinition for use in association with the prevailing receiver message.215. The method of claim 214, wherein the transmitting the prevailingreceiver message from the node to the one or more other nodes incommunication with the wireless network includes: identifying a nextreceiving node among the other nodes in the wireless network, andtransmitting the prevailing receiver message together with at least oneinformation message bound for the identified next receiving node.
 216. Acomputer program product embodied on a non-transitory computer readablemedium, comprising: computer code for generating a receiver message at anode, the receiver message including one or more reception definitions,each reception definition indicating a time or manner in which the nodeis to receive information messages; computer code for modifying thereceiver message; and computer code for causing a prevailing receivermessage to be transmitted to one or more other nodes in communicationwith a wireless network; wherein the computer program product isoperable such that the modifying the receiver message includes:receiving incoming information messages in accordance with a particularreception definition, discontinuing use of the particular receptiondefinition, and generating a new reception definition for use inassociation with the prevailing receiver message.
 217. An apparatus,comprising: a memory; and circuitry in communication with the memory,the circuitry configured with a capability to cause the apparatus to:store one or more reception definitions, each reception definitionindicating a time and manner associated with information messagereceipt, store one or more updated reception definitions, andcommunicate a reception definition message with respect to one or morenodes in communication with a wireless network; wherein, in associationwith the one or more updated reception definitions, the circuitry isconfigured with the capability to cause: communication of informationmessages in accordance with a particular reception definition,discontinuance of use of the particular reception definition, andstorage of a new reception definition for use.
 218. The apparatus ofclaim 217, further comprising a database configured to store one or moreof the reception definitions that are generated by the apparatus. 219.The apparatus of claim 217, further comprising a database configured tostore one or more of the reception definitions that are received by theapparatus from the one or more other nodes.
 220. The apparatus of claim219, wherein the circuitry is configured to cause the apparatus togenerate contents of the reception definition message based on the oneor more received reception definitions.
 221. The apparatus of claim 217,wherein a database is configured to store a data structure.
 222. Theapparatus of claim 221, wherein the data structure includes a nodeidentification field.
 223. The apparatus of claim 221, wherein the datastructure includes an array of reception definitions.
 224. The apparatusof claim 223, wherein each reception definition in the array includes areception start indicator.
 225. The apparatus of claim 224, wherein eachreception definition in the array includes a reception duration. 226.The apparatus of claim 224, wherein each reception definition in thearray includes a reception channel.
 227. The apparatus of claim 217,wherein the circuitry includes hardware circuitry.
 228. The apparatus ofclaim 217, wherein the circuitry is part of an application-specificintegrated circuit.
 229. The apparatus of claim 217, wherein the timeincludes a duration time period.
 230. The apparatus of claim 229,wherein the circuitry is configured to cause the apparatus to power downa receiver after the duration time period has lapsed.
 231. The apparatusof claim 217, wherein the manner indicates a duration.
 232. Theapparatus of claim 217, wherein the manner indicates a channel.
 233. Theapparatus of claim 232, wherein the channel includes a carrierfrequency.
 234. The apparatus of claim 217, wherein the apparatus isoperable such that at least one aspect of the reception definitionmessage is based on a pseudo-random number.
 235. The apparatus of claim234, wherein the aspect includes the time.
 236. The apparatus of claim234, wherein the aspect includes a channel.
 237. The apparatus of claim234, wherein the aspect includes a duration.
 238. The apparatus of claim217, wherein the apparatus is operable such that at least one aspect ofthe reception definition message is based, at least in part, on aphysical random number.
 239. The apparatus of claim 238, wherein theaspect includes the time.
 240. The apparatus of claim 238, wherein theaspect includes a channel.
 241. The apparatus of claim 238, wherein theaspect includes a duration.
 242. The apparatus of claim 217, wherein theapparatus is operable to communicate the information messages bypowering up a receiver.
 243. The apparatus of claim 217, wherein theapparatus is operable to communicate the information messages by tuninga receiver.
 244. The apparatus of claim 217, wherein the apparatus isoperable such that the one or more reception definitions is updatedmultiple times.
 245. The apparatus of claim 217, wherein the apparatusis operable such that the one or more reception definitions isperiodically updated.
 246. The apparatus of claim 217, wherein theapparatus is operable to function in a network environment that includesa first node, an intermediate node, and a second node, wherein the firstnode is adapted to communicate with the second node via the intermediatenode, where the apparatus is adapted to operate as one of: the firstnode, the second node, or the intermediate node.
 247. The apparatus ofclaim 217, wherein the time is included with the one or more receptiondefinitions for power conservation purposes.
 248. The apparatus of claim247, wherein the apparatus is operable to function in a networkenvironment that includes a plurality of nodes, where a node receiver ofat least one of the plurality of nodes is powered off based on the oneor more reception definitions for the power conservation purposes. 249.The apparatus of claim 217, wherein the apparatus is operable such thata plurality of the reception definitions are included in the receptiondefinition message, and the reception definition message includes asingle message.
 250. The apparatus of claim 217, wherein the apparatusis operable to accommodate a single one of the reception definitionsbeing in a single message.
 251. The apparatus of claim 217, wherein thereception definition message is a schedule message.
 252. The apparatusof claim 251, wherein the schedule message is accompanied by a checksum.253. The apparatus of claim 251, wherein the schedule message includes aplurality of the reception definitions associated with different nodes.254. The apparatus of claim 251, wherein the schedule message includes aplurality of the reception definitions associated with differentcommunication entities.
 255. The apparatus of claim 251, wherein theschedule message includes one or more reception definitions receivedfrom one or more different nodes.
 256. The apparatus of claim 217,wherein the reception definition message includes an identifier of theapparatus.
 257. The apparatus of claim 217, wherein the receptiondefinition message includes an identifier of at least one other node.258. The apparatus of claim 257, wherein the reception definitionmessage includes another node reception definition which is associatedwith the at least one other node.
 259. The apparatus of claim 258,wherein the apparatus is operable such that the another node receptiondefinition is received from the at least one other node.
 260. Theapparatus of claim 258, wherein the another node reception definitionincludes a reception start indicator associated with the at least oneother node.
 261. The apparatus of claim 258, wherein the another nodereception definition includes a reception duration associated with theat least one other node.
 262. The apparatus of claim 258, wherein theanother node reception definition includes a reception channelassociated with the at least one other node.
 263. The apparatus of claim217, wherein the circuitry is configured to accommodate the one or morereception definitions being accompanied by at least one informationmessage.
 264. The apparatus of claim 217, wherein the apparatus isadapted to be a component of a mobile phone.
 265. The apparatus of claim217, wherein the apparatus is adapted for being battery-powered. 266.The apparatus of claim 217, wherein the apparatus is adapted to be acomponent of a laptop.
 267. The apparatus of claim 217, wherein theapparatus includes a serial port.
 268. The apparatus of claim 217,wherein the apparatus is capable of being notified when at least oneother node is unavailable for communication.
 269. The apparatus of claim217, wherein the apparatus is operable to function in a networkenvironment that includes an ad-hoc wireless network.
 270. The apparatusof claim 217, wherein the apparatus is operable to accommodate a numberof the reception definitions being dynamically determined.
 271. Theapparatus of claim 217, wherein the apparatus is operable to communicatevia a plurality of antennae in an array.
 272. The apparatus of claim217, wherein the apparatus is operable to interface a plurality ofantennae.
 273. The apparatus of claim 217, wherein the receptiondefinition message is a next message.
 274. The apparatus of claim 217,wherein the reception definition message is a pending message.
 275. Theapparatus of claim 217, wherein the apparatus is operable to accommodatethe reception definition message being communicated along with datatraffic.
 276. The apparatus of claim 217, wherein the apparatus isoperable such that the one or more reception definitions is communicatedalong with at least one other reception definition received from anothernode.
 277. The apparatus of claim 276, wherein the apparatus is operablesuch that the one or more reception definitions and the at least oneother reception definition received from another node, are independentlygenerated.
 278. The apparatus of claim 217, wherein the apparatus isoperable such that use of the one or more reception definitions avoidsconsideration for a predefined time slot plan, at least in part. 279.The apparatus of claim 217, wherein the apparatus is operable such thatuse of the one or more reception definitions provides flexibility byavoiding, at least in part, restrictive time slot limitations.
 280. Theapparatus of claim 217, wherein the apparatus is operable such that theone or more reception definitions cause a receiver duty cycle to bemodified.
 281. The apparatus of claim 217, wherein the apparatus isoperable such that the one or more reception definitions is based on atype of activity the apparatus is performing.
 282. The apparatus ofclaim 217, wherein the apparatus is operable such that the one or morereception definitions is based on a prevailing data traffic rate. 283.The apparatus of claim 217, wherein the apparatus is operable such thatat least one aspect of the one or more reception definitions is based ona number of other nodes within communication range.
 284. The apparatusof claim 217, wherein the apparatus is operable such that the one ormore reception definitions cause a duration of a reception interval tobe modified.
 285. The apparatus of claim 217, wherein the apparatus isoperable such that the one or more reception definitions cause aduration of a reception interval to modified to accommodatetransmissions of varying length.
 286. The apparatus of claim 217,wherein the apparatus is operable such that at least one aspect of theone or more reception definitions is adapted to be adjusted toaccommodate communications of varying length.
 287. The apparatus ofclaim 217, wherein the apparatus is operable such that at least oneaspect of the one or more reception definitions is adjusted toaccommodate transmissions of shorter control packets.
 288. The apparatusof claim 217, wherein the apparatus is operable such that at least oneaspect of the one or more reception definitions is adjusted toaccommodate transmissions of longer data packets.
 289. The apparatus ofclaim 217, wherein the apparatus is operable such that the one or morereception definitions make it more difficult to monitor or jamcommunications.
 290. The apparatus of claim 217, wherein the receptiondefinition message includes a local reception definition message. 291.The apparatus of claim 217, wherein the manner is that in which theapparatus will operate to communicate the information messages.
 292. Theapparatus of claim 217, wherein the apparatus is capable of operating asan endpoint.
 293. The apparatus of claim 217, wherein the apparatus iscapable of operating as an intermediate node.
 294. The apparatus ofclaim 217, wherein the apparatus is operable such that at least one ofthe one or more reception definitions is updated a plurality ofinstances.
 295. The apparatus of claim 217, wherein the apparatus isoperable such that at least one of the one or more reception definitionsis updated periodically.
 296. The apparatus of claim 217, wherein thereception definition message is a receiver schedule.
 297. The apparatusof claim 217, wherein at least one of the one or more receptiondefinitions includes a dynamically-generated reception definition. 298.The apparatus of claim 217, wherein the apparatus is operable such thatat least one parameter value of at least one of the one or morereception definitions is dynamically determined.
 299. The apparatus ofclaim 217, wherein the apparatus is operable such that at least oneparameter value of at least one of the one or more reception definitionsis preset.
 300. The apparatus of claim 217, wherein the apparatus iscapable of operating as a component of a router.
 301. The apparatus ofclaim 217, wherein the apparatus is capable of operating as a componentof a relay.
 302. The apparatus of claim 217, wherein the apparatus iscapable of operating as a component of an endpoint that is a sourcedevice.
 303. The apparatus of claim 217, wherein the apparatus iscapable of operating as a component of an endpoint that is a destinationdevice.
 304. The apparatus of claim 217, wherein the apparatus isdesigned to be stationary.
 305. The apparatus of claim 217, wherein theapparatus is designed to be mobile.
 306. The apparatus of claim 217,wherein the apparatus is operable such that a plurality of transmittedinformation messages are transmitted by way of at least one data packet.307. The apparatus of claim 217, wherein the apparatus is operable suchthat a plurality of transmitted information messages are transmitted byway of at least one control packet.
 308. The apparatus of claim 217,wherein the apparatus is capable of operating as a component of a systemincluding a global positioning system.
 309. The apparatus of claim 217,wherein the apparatus is operable to cooperate with a global positioningsystem for providing a local time base for synchronization purposes.310. The apparatus of claim 217, wherein the apparatus is operable suchthat at least one of the one or more reception definitions isdynamically determined.
 311. The apparatus of claim 217, wherein theapparatus is operable such that at least one of the one or morereception definitions is dynamically determined based on a number ofnodes participating or expected to participate in the wireless network.312. The apparatus of claim 217, wherein the apparatus is operable suchthat at least one of the one or more reception definitions isdynamically determined based on a prevailing or expected volume ofnetwork traffic.
 313. The apparatus of claim 217, wherein the apparatusis operable such that at least one of the one or more receptiondefinitions is dynamically determined to maximize network efficiency fora given context.
 314. The apparatus of claim 217, wherein the apparatusis operable such that at least one of the one or more receptiondefinitions is dynamically determined based on a number of neighboringnodes.
 315. The apparatus of claim 217, wherein the apparatus isoperable such that at least one of the one or more reception definitionsis dynamically determined based on a power remaining in an apparatusbattery.
 316. The apparatus of claim 217, wherein the apparatus isoperable such that at least one of the one or more reception definitionsis dynamically determined based on one or more known schedules for theone or more other nodes in the network.
 317. The apparatus of claim 217,wherein the apparatus is operable such that at least one of the one ormore reception definitions is dynamically determined based on apseudo-random number generator.
 318. The apparatus of claim 217, whereinthe apparatus is operable such that at least one of the one or morereception definitions is dynamically determined based on a random numbergenerator.
 319. The apparatus of claim 217, wherein the apparatus isoperable such that the reception definition message is adapted tomaintain synchronization.
 320. The apparatus of claim 217, wherein atleast one of the one or more reception definitions includes at least oneparameter that sufficiently describes a reception instance for aparticular media.
 321. The apparatus of claim 217, wherein at least oneof the one or more reception definitions includes at least one parameterthat sufficiently describes a reception instance for a particularformat.
 322. The apparatus of claim 217, wherein the apparatus isoperable such that a use of the particular reception definition isdiscontinued by deleting the particular reception definition.
 323. Theapparatus of claim 217, wherein the apparatus is operable such that onlya portion of a reception definition database is stored if the receptiondefinition database exceeds a certain size.
 324. The apparatus of claim217, wherein the apparatus is operable such that a complete set ofreception definitions for all nodes in the wireless network is capableof being included in a single schedule message.
 325. The apparatus ofclaim 217, wherein the apparatus is operable such that the receptiondefinition message is communicated in association with a beacon. 326.The apparatus of claim 217, wherein the apparatus is operable such thatthe reception definition message is communicated in association with abeacon that is communicated at preset times.
 327. The apparatus of claim217, wherein the apparatus is operable such that the receptiondefinition message is communicated in association with a beacon that iscommunicated at pseudo-random times.
 328. The apparatus of claim 217,wherein the apparatus is operable such that the reception definitionmessage is adapted to allow a newly arriving node that has yet toreceive any reception definition message, to successfully receive ortransmit a first information message.
 329. The apparatus of claim 217,wherein the apparatus is operable such that the reception definitionmessage is adapted to allow a newly arriving node to functional normallyin the wireless network.
 330. The apparatus of claim 217, wherein theapparatus is operable such that incoming timing parameters are mapped toa time base of the apparatus.
 331. The apparatus of claim 217, whereinthe apparatus is operable so as to utilize a rolling window of receptiondefinitions.
 332. The apparatus of claim 217, wherein the apparatus isoperable so as to utilize a rolling window.
 333. The apparatus of claim217, wherein the reception definition message includes an errorcorrection field.
 334. The apparatus of claim 217, wherein the receptiondefinition message includes a parameter count field.
 335. The apparatusof claim 217, wherein the reception definition message includes areception definition count field.
 336. The apparatus of claim 217,wherein the reception definition message is encrypted.
 337. Theapparatus of claim 217, wherein the reception definition messageincludes a node identifier field.
 338. The apparatus of claim 217,wherein the communication includes a broadcast communication.
 339. Theapparatus of claim 217, wherein the apparatus is operable such that atleast one aspect of at least one of the one or more receptiondefinitions includes an independently-generated aspect.
 340. Theapparatus of claim 217, wherein the reception definition messageincludes at least one of the one more of the reception definitionshaving a next status.
 341. The apparatus of claim 217, wherein thereception definition message includes at least one of the one morereception definitions having a pending status.
 342. The apparatus ofclaim 217, wherein the reception definition message includes only aportion of the one more reception definitions.
 343. The apparatus ofclaim 342, wherein the apparatus is operable such that the portion isselected based on the one or more other nodes to which the receptiondefinition message is directed.
 344. The apparatus of claim 217, whereinthe apparatus is operable such that a number of the one or morereception definitions is based on a number of nodes participating in anetwork.
 345. The apparatus of claim 217, wherein the apparatus isoperable such that a number of the one or more reception definitions isbased on a number of nodes expected to participate in a network. 346.The apparatus of claim 217, wherein the apparatus is operable such thata number of the one or more reception definitions is based on aprevailing volume of network traffic.
 347. The apparatus of claim 217,wherein the apparatus is operable such that a number of the one or morereception definitions is based on an expected volume of network traffic.348. The apparatus of claim 217, wherein the apparatus is operable suchthat a number of the one or more reception definitions is selected tomaximize network efficiency for a given context.
 349. The apparatus ofclaim 217, wherein the apparatus is operable such that a number ofparameters of at least one of the one or more reception definitions isbased on a format used to communicate the information messages.
 350. Theapparatus of claim 217, wherein the apparatus is operable such that atype of parameters of the one or more reception definitions is based ona format used to communicate the information messages.
 351. Theapparatus of claim 217, wherein the apparatus is operable such that oneor more parameter values of the one or more reception definitions areselected based on a number of the other nodes.
 352. The apparatus ofclaim 217, wherein the apparatus is operable such that one or moreparameter values of the one or more reception definitions are selectedbased on a power remaining in a battery.
 353. The apparatus of claim217, wherein the apparatus is operable such that one or more parametervalues of the one or more reception definitions are selected based on aschedule for at least one of the other nodes.
 354. The apparatus ofclaim 217, wherein the apparatus is operable such that at least one ofthe one or more reception definitions is generated in parallel withcommunication of the reception definition message inclusive of at leastone other of the one or more reception definitions.
 355. The apparatusof claim 217, wherein the apparatus is operable such that the receptiondefinition message is inclusive of at least one of the one or morereception definitions that is selected based on a node ranking.
 356. Theapparatus of claim 217, wherein the apparatus is operable such that thereception definition message is inclusive of at least one of the one ormore reception definitions that is selected based on a traffic flow.357. The apparatus of claim 217, wherein the apparatus is operable suchthat the reception definition message is inclusive of at least one ofthe one or more reception definitions that is selected based on a pathcharacteristic.
 358. The apparatus of claim 217, wherein the apparatusis operable such that the reception definition message is inclusive ofat least one of the one or more reception definitions that is located ina header of the reception definition message.
 359. The apparatus ofclaim 217, wherein the time and the manner are those in which theapparatus is to communicate the information messages.
 360. The apparatusof claim 217, wherein the time and the manner are those in which theapparatus is capable of communicating the information messages.
 361. Theapparatus of claim 217, wherein the time includes a start time.
 362. Theapparatus of claim 217, wherein the time is a relative time.
 363. Theapparatus of claim 217, wherein the time is an absolute time.
 364. Theapparatus of claim 217, wherein the manner includes at least one aspectother than the time.
 365. The apparatus of claim 217, wherein the mannerincludes at least one aspect that is not time related.
 366. Theapparatus of claim 217, wherein the manner includes at least one aspectthat is time related.
 367. The apparatus of claim 217, wherein theapparatus is operable such that the information messages arecommunicated utilizing a time division multiple access format.
 368. Theapparatus of claim 217, wherein the apparatus is operable such that theinformation messages are communicated utilizing a frequency divisionmultiple access format.
 369. The apparatus of claim 217, wherein theapparatus is operable such that the information messages arecommunicated utilizing both a time division multiple access format and afrequency division multiple access format.
 370. The apparatus of claim217, wherein the apparatus is operable such that the informationmessages are communicated utilizing a pulse width modulation format.371. The apparatus of claim 217, wherein the apparatus is operable suchthat the information messages are communicated utilizing a pulse codemodulation format.
 372. The apparatus of claim 217, wherein the mannerindicates a channel that includes at least one carrier frequency. 373.The apparatus of claim 217, wherein the apparatus is operable such thata node ranking is dynamically determined.
 374. The apparatus of claim217, wherein, when communicating the reception definition message withrespect to the one or more other nodes in communication with thewireless network, the circuitry is configured to cause the apparatus to:identify a next receiving node from among the one or more other nodes inthe wireless network, determine whether an information message is boundfor the identified next receiving node, and when the information messageis bound for the identified next receiving node, cause the receptiondefinition message to be communicated to the identified next receivingnode.
 375. The apparatus of claim 374, further comprising a databaseconfigured to store the one or more reception definitions that aregenerated by the apparatus and one or more other reception definitionsreceived by the apparatus from the one or more other nodes in thewireless network.
 376. The apparatus of claim 375, wherein the circuitrygenerates the reception definition message based on the other receptiondefinitions.
 377. The apparatus of claim 375, wherein, when identifyingthe next receiving node, the circuitry is configured to cause theapparatus to analyze the database to determine an earliest start timeamong stored reception definitions associated with other network nodes.378. The apparatus of claim 375, wherein, when communicating thereception definition message with respect to the identified nextreceiving node, the circuitry is configured to cause the apparatus toadditionally cause reception definitions associated with the one or moreother network nodes to be communicated to the identified next receivingnode.
 379. The apparatus of claim 375, wherein the database isconfigured to cause the apparatus to store a data structure including atleast one node receiver schedule.
 380. The apparatus of claim 379,wherein each node receiver schedule in the data structure includes anode identification field and an array of reception definitions. 381.The apparatus of claim 380, wherein each reception definition in thedata structure includes a reception start time, a reception duration,and a reception channel.
 382. The apparatus of claim 217, wherein theapparatus is operable such that at least one of the one or morereception definitions is generated in parallel with communication of thereception definition message.
 383. The apparatus of claim 217, whereinthe apparatus is operable to function in a network environment thatincludes a first node, an intermediate node, and a second node, whereinthe first node is adapted to communicate with the second node via theintermediate node, where the apparatus is adapted to operate as thefirst node, where the apparatus is further adapted to operate as thesecond node, where the apparatus is adapted to even further adapted tooperate as the intermediate node.
 384. The apparatus of claim 217,wherein the apparatus is operable to function in a network environmentthat includes a first stationary node and a second mobile node, wherethe apparatus is adapted to operate as the first stationary node, wherethe apparatus is further adapted to operate as the second mobile node.385. The apparatus of claim 217, wherein the circuitry is configured topower down a receiver based on the time of at least one of the one ormore reception definitions.
 386. The apparatus of claim 217, wherein thecircuitry is further configured to cause the apparatus to store in atleast one data structure a plurality of the reception definitionsincluding one or more first reception definitions received by theapparatus from the one or more other nodes and one or more secondreception definitions generated by the apparatus, the one or more firstreception definitions and the one or more second one or more receptiondefinitions being independently generated, each reception definition inthe at least one data structure including a reception start indicator, areception duration, and an identifier corresponding to at least oneassociated node; wherein the apparatus is operable to function incombination with an antennae array inclusive of a plurality of antennaecapable of communicating with the circuitry; wherein the apparatus iscapable of being notified when at least one other node is unavailablefor communication; wherein the reception definition message includesonly a portion of the one more reception definitions that are stored inthe at least one data structure; wherein the circuitry is furtherconfigured with a capability to cause the apparatus to power down areceiver based on at least the time of at least one of the one or morereception definitions; wherein the reception definition message includesa reception definition count field.
 387. The apparatus of claim 217,wherein the manner includes connection-related information.
 388. Theapparatus of claim 217, wherein a node receiver of the apparatus isadapted to be powered off based on the one or more reception definitionsfor power conservation purposes.
 389. The apparatus of claim 217,wherein the reception definition message includes at least one of theone or more reception definitions that is associated with a plurality ofdifferent nodes.
 390. The apparatus of claim 217, wherein the receptiondefinition message includes at least one of the one or more receptiondefinitions that is associated with a plurality of differentcommunication mechanisms.
 391. The apparatus of claim 390, wherein thedifferent communication mechanisms include different communicationchannels.
 392. The apparatus of claim 217, wherein the one or morereception definitions indicates a communication direction.
 393. Theapparatus of claim 217, wherein the apparatus is operable such thatdifferent aspects of at least one of the one or more receptiondefinitions are independently generated by different nodes.
 394. Theapparatus of claim 217, wherein the communication of the informationmessages includes receiving the information messages.
 395. The apparatusof claim 217, wherein the communication of the information messagesincludes transmitting the information messages.
 396. The apparatus ofclaim 217, wherein the communication of the reception definition messageincludes receiving the reception definition message.
 397. The apparatusof claim 217, wherein the communication of the reception definitionmessage includes transmitting the reception definition message.
 398. Theapparatus of claim 217, wherein the communication includes receiving andtransmitting.
 399. The apparatus of claim 217, wherein the informationmessage receipt relates to receipt of the information messages by theapparatus.
 400. The apparatus of claim 217, wherein the informationmessage receipt relates to receipt of the information messages by theone or more nodes.
 401. The apparatus of claim 217, wherein thecircuitry is further configured to cause the apparatus to store in atleast one data structure a plurality of the reception definitionsincluding one or more first reception definitions received by theapparatus from the one or more other nodes and one or more secondreception definitions including at least one aspect capable of beingcontrolled by the apparatus; wherein the apparatus is operable tofunction in combination with an antennae array inclusive of a pluralityof antennae; wherein the circuitry is further configured with acapability to cause the apparatus to power down a receiver based on atleast the time of at least one of the one or more reception definitions.402. The apparatus of claim 401, wherein each reception definition inthe at least one data structure includes a reception start indicator anda reception duration.
 403. The apparatus of claim 217, wherein theapparatus is operable such that at least one first aspect of at leastone of the one or more reception definitions is generated by a firstnode, and at least one second aspect of the at least one of the one ormore reception definitions is generated by a second node.
 404. Theapparatus of claim 217, wherein the apparatus is operable such that onlya portion of a reception definition database is stored.